منابع مشابه
Scheduling in polling systems
We present a simple mean value analysis (MVA) framework for analyzing the effect of scheduling within queues in classical asymmetric polling systems with gated or exhaustive service. Scheduling in polling systems finds many applications in computer and communication systems. Our framework leads not only to unification but also to extension of the literature studying scheduling in polling system...
متن کاملMulticycle Polling Scheduling Algorithm
The paper deals with the scheduling of periodic information flow in FieldBus environment. The scheduling problem is defined from an analytical point of view, giving a brief survey of the most well-known solutions, and illustrating multicycle polling scheduling which is based on the hypothesis that all the production period of the periodic processes to be scheduled are harmonic. Although in some...
متن کاملPolling and Bridge Scheduling Algorithms in Bluetooth
This report presents a brief overview and classification of intra-piconet polling schemes for Bluetooth piconets. It also presents a similar overview and classification of bridge scheduling algorithms for Bluetooth scatternets. Some additional issues, in particular the transmission of TCP/IP traffic over Bluetooth, and segmentation and reassembly policies, are discussed as well.
متن کاملDynamic Routing in Polling Systems
Polling systems have important applications to Telecommunication Systems, Data Link Protocols, Local Area Computer Networks, Flexible Manufacturing Systems, etc. As such they have been the subject of extensive research in recent years, most notably in the context of cyclic queues. The focus of much of this research has been on evaluating performance measures of fixed-template routing schemes wi...
متن کاملFluid polling systems
We study N-queues single-server fluid polling systems, where a fluid is continuously flowing into the queues at queue-dependent rates. When visiting and serving a queue, the server reduces the amount of fluid in that queue at a queue-dependent rate. Switching from queue i to queue j requires two random-duration steps: (i) departing queue i, and (ii) reaching queue j. The length of time the serv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Performance Evaluation
سال: 2007
ISSN: 0166-5316
DOI: 10.1016/j.peva.2007.06.015